FPGA-based implementation of recursive algorithms
نویسندگان
چکیده
منابع مشابه
FPGA-based implementation of recursive algorithms
The paper suggests a novel method for implementing recursive algorithms in hardware. The required support for recursion has been provided through a modular and a hierarchical specification of a control unit that can be translated to an implementation of the respective hardware circuit on the basis of a recursive hierarchical finite state machine and through a mechanism that permits the contents...
متن کاملDesign Methods for Fpga-based Implementation of Combinatorial Search Algorithms
Many combinatorial search problems can be efficiently formulated and solved over Boolean and ternary matrices that keep the initial and all the required intermediate data. Three of such problems, namely, the Boolean satisfiability, covering and graph coloring, have been examined and analyzed. The results of analysis make it possible suggesting a number of reusable functional blocks for the cons...
متن کاملStudy of Hummingbird Cryptographic Algorithms based on FPGA Implementation
Cryptographic algorithms are ubiquitous in modern communication systems where they have a central role in ensuring information security. This thesis studies efficient implementation of certain widely-used cryptographic algorithms. Cryptographic algorithms are computationally demanding and software-based implementations are often too slow or power consuming which yields a need for hardware imple...
متن کاملModelling and FPGA-based Implementation of Graph Colouring Algorithms
The paper discusses an effective matrix-based exact algorithm for graph colouring that is well-suited for implementation in FPGA. It is shown that the algorithm can also be used as a base for a number of approximate algorithms. Software models (described in C++) and hardware circuits (synthesised from Handel-C specifications) for the exact algorithm are discussed, analysed and compared. Charact...
متن کاملFPGA Implementation of Polynomial Evaluation Algorithms
The most-significant-digit-first function evaluation method (E-method) allows efficient evaluation of polynomials and certain rational functions on custom hardware. The time required for the computation is of the order of m carry-free addition operations, m being the number of digits in the result. We discuss a digit-parallel and a digit-serial implementation of this method on a DecPeRLe-1 boar...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Microprocessors and Microsystems
سال: 2004
ISSN: 0141-9331
DOI: 10.1016/j.micpro.2004.03.008